     REM This program uses the so-called Babylonian Algorithm
     REM without estimation.
  10 INPUT "Enter precision (0-4): ";A : IF (A>4)+(A<0) THEN GOTO 10
     LET B=2147483647/10^(A+A) : IF A=0 THEN LET B=B-1
  20 PRINT "Enter number (<";B+1;"): "; : INPUT "";C : IF (C<0)+(C>B) THEN GOTO 20
     LET @(250)=C : LET @(251)=A : GOSUB 9030
     PRINT : PRINT "SQRT(";C;") = ";@(250)/(10^A);".";
     FOR Q=1 TO A-1  : IF @(250)%(10^A) < 10^Q THEN PRINT "0";
     NEXT Q : PRINT @(250)%(10^A) : END
9030 LET @(252)=@(250)*(10^(@(251)+@(251)))
9040 LET @(253)=((@(252)+((@(250)*(10^(@(251)+@(251))))/@(252))))/2
     IF (@(252)=@(253))+(@(252)=@(253)+1) THEN LET @(250)=@(253) : RETURN
     LET @(252)=@(253) : GOTO 9040
     REM ** This is an integer SQR subroutine. Output is scaled by 2^@(251).